Identification and partial characterization of C-glycosylflavone markers in Asian plant dyes using liquid chromatography-tandem mass spectrometry

Flavonoids in the grasses (Poaceae family), Arthraxon hispidus (Thunb.) Makino and Miscanthus tinctorius (Steudel) Hackel have long histories of use for producing yellow dyes in Japan and China, but up to now there have been no analytical procedures for characterizing the dye components in textiles dyed with these materials. LC-MS analysis of plant material and of silk dyed with extracts of these plants shows the presence, primarily, of flavonoid C-glycosides, three of which have been tentatively identified as luteolin 8-C-rhamnoside, apigenin 8-C-rhamnoside and luteolin 8-C-(4-ketorhamnoside). Two of these compounds, luteolin 8-C-rhamnoside (M=432), apigenin 8-C-rhamnoside (M=416), along with the previously known tricin (M=330) and several other flavonoids that appear in varying amounts, serve as unique markers for identifying A. hispidus and M. tinctorius as the source of yellow dyes in textiles. Using this information, we have been able to identify grass-derived dyes in Japanese textiles dated to the Nara and Heian periods. However, due to the high variability in the amounts of various flavonoid components, our goal of distinguishing between the two plant sources remains elusive.     

不同调制周期MoS2/DLC多层薄膜结构及摩擦学性能

采用多靶射频磁控溅射方法,在Si(100)衬底上制备不同调制周期(Λ分别为54 nm、30 nm、18 nm)MoS_2/类金刚石(DLC)多层薄膜.利用扫描电子显微镜、拉曼光谱仪、X射线衍射仪、透射电子显微镜、纳米压痕仪研究多层膜的形貌、微观结构及力学性能受调制周期的影响规律;利用球-盘摩擦试验机考察薄膜在大气环境下的润滑性能.结果表明:采用交替沉积MoS_2/DLC多层膜可有效抑制溅射MoS_2中柱状结构生长,制备的薄膜结构致密;多层膜硬度随调制周期的增加而增大.透射断面分析表明:多层膜层间界面不平整但周期性结构清晰且致密,其调制周期厚度与试验设定值基本一致.与纯MoS_2薄膜相比,调制周期为54 nm的薄膜具有较好的法向承载及弹性恢复能力,其硬度最高,达7.15 GPa;法向载荷为5 N时,该薄膜在大气环境(相对湿度约30%)下具有最低的摩擦系数(0.09)和最低的磨损率[1.34×10~(–7) mm~3/(N·m)].     

Combinatorics on partial word correlations

Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. In this paper, we consider the period and weak period sets of partial words of length n over a finite alphabet, and study the combinatorics of specific representations of them, called correlations, which are binary and ternary vectors of length n indicating the periods and weak periods. We characterize precisely which vectors represent the period and weak period sets of partial words and prove that all valid correlations may be taken over the binary alphabet. We show that the sets of all such vectors of a given length form distributive lattices under suitably defined partial orderings. We show that there is a well-defined minimal set of generators for any binary correlation of length n and demonstrate that these generating sets are the primitive subsets of {1,2,…,n−1}. We also investigate the number of partial word correlations of length n. Finally, we compute the population size, that is, the number of partial words sharing a given correlation, and obtain recurrences to compute it. Our results generalize those of Guibas, Odlyzko, Rivals and Rahmann.     

Weak convergence of Markov-modulated random sequences

This work is concerned with weak convergence of non-Markov random processes modulated by a Markov chain. The motivation of our study stems from a wide variety of applications in actuarial science, communication networks, production planning, manufacturing and financial engineering. Owing to various modelling considerations, the modulating Markov chain often has a large state space. Aiming at reduction of computational complexity, a two-time-scale formulation is used. Under this setup, the Markov chain belongs to the class of nearly completely decomposable class, where the state space is split into several subspaces. Within each subspace, the transitions of the Markov chain varies rapidly, and among different subspaces, the Markov chain moves relatively infrequently. Aggregating all the states of the Markov chain in each subspace to a single super state leads to a new process. It is shown that under such aggregation schemes, a suitably scaled random sequence converges to a switching diffusion process.     

The First Principle Calculation of Green—Kubo Formula with the Two—Time Ensemble Technique

For weak-coupling electronic plasmas in the presence of small fluctuations,we calculate Green-Kuboformula for transport coefficients employing the ab initio theory,i.e.,the two-time ensemble technique.The microscopic interpretations of Onsager‘s hypothesis on fluctuations are presented in the framework.     

不同阶段变环境下Weibull分布的可靠性估计

本文研究了Weibull分布在不同阶段和环境下的设备可靠性,给出了Weibull分布不同阶段和环境下的参数估计方法,并证明了估计量的一致强相合性,模拟结果表明方法的实践可用性。     

Coven和Hedlund一个定理的较简单的证明

Coven和Hedlund在[1]中证明：若区间映射的周期集为有限集,则它的每一个非游荡点都是周期点。本给出了这一定理的一个较简单的证明。此外,我们还用“同伦”的方法简化了该的一个关键引理的证明。     

一种面向编译器的数据访问节能技术研究

当前针对磁盘功率管理的大部分研究都是把重点放在磁盘空闲周期的利用上。人们相继研究了硬件功率节约机制(比如降速磁盘和多速磁盘)和补充性的软件策略(比如改变代码和数据布局,以提高空闲周期的长度)。然而,硬件功率节约机制无法处理高能耗并行应用的短空闲周期,而代码/数据重组策略往往要求大规模的代码更改。在本文中,我们提出一种面向编译器的数据访问(I/O调用)调度技术,以节约磁盘能量,在更短的周期内聚集了尽可能多的数据请求,进而延长了磁盘空闲周期,提升硬件功率管理机制的有效性。与先前基于软件的策略相比,该技术不需重组代码或数据。在基于集群的仿真环境下结合6种应用程序对本文方法进行评估。结果表明,本文方法提升了降速磁盘和多速磁盘的性能,将功率节约平均效果提升了一倍。